Initial Domain Theory Knowledge Extraction Knowledge Insertion Symbolic Representation Refined Domain Theory

نویسندگان

  • Sean Snyders
  • Christian W. Omlin
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Architecture Based on Support Vector Machines

An hybrid SVM-symbolic architecture for classification tasks is proposed in this work. The learning system relies on a support vector machine (SVM), meanwhile a rule extraction module translate the embedded knowledge in the trained SVM in the form of symbolic rules. The new representation is useful to understand the nature of the problem and its solution. Moreover, a rule insertion module in th...

متن کامل

Artificial nonmonotonic neural networks

In this paper, we introduce Artificial Nonmonotonic Neural Networks (ANNNs), a kind of hybrid learning systems that are capable of nonmonotonic reasoning. Nonmonotonic reasoning plays an important role in the development of artificial intelligent systems that try to mimic common sense reasoning, as exhibited by humans. On the other hand, a hybrid learning system provides an explanation capabili...

متن کامل

Symbolic Interpretation of Arti cial Neural Networks

H ybrid Intelligent Systems that combine knowledge based and artiicial neural network systems typically have four phases involving domain knowledge representation, mapping of this knowledge into an initial connectionist architecture, network training, and rule extraction respectively. The nal phase is important because it can provide a trained connectionist architecture with explanation power a...

متن کامل

RULEX & CEBP Networks As the Basis for a Rule Refinement System

In artificial intelligence, knowledge is often represented as a set of rules to be interpreted by an expert system. This rule base is garnered from the knowledge of a domain expert and, for a variety of reasons, may be incomplete, contradictory, or inaccurate. A system using these rules is also static and unable to learn new rules or modify existing rules in the problem domain. In this paper we...

متن کامل

Symbolic Knowledge Representation in Recurrent Neural Networks: Insights from Theoretical Models of Computation

We give an overview of some of the fundamental issues found in the realm of recurrent neural networks. We use theoretical models of computation to characterize the representational, computational, and learning capabilitities of recurrent network models. We discuss how results derived for deterministic models can be generalized to fuzzy models. We then address how these theoretical models can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001